Economic-based ACO Algorithm for Data Intensive Grid Scheduling
نویسندگان
چکیده
منابع مشابه
P. MATHIYALAGAN et al.: ENHANCED HYBRID PSO – ACO ALGORITHM FOR GRID SCHEDULING ENHANCED HYBRID PSO – ACO ALGORITHM FOR GRID SCHEDULING
Grid computing is a high performance computing environment to solve larger scale computational demands. Grid computing contains resource management, task scheduling, security problems, information management and so on. Task scheduling is a fundamental issue in achieving high performance in grid computing systems. A computational GRID is typically heterogeneous in the sense that it combines clus...
متن کاملEnhanced Hybrid Pso – Aco Algorithm for Grid Scheduling
Grid computing is a high performance computing environment to solve larger scale computational demands. Grid computing contains resource management, task scheduling, security problems, information management and so on. Task scheduling is a fundamental issue in achieving high performance in grid computing systems. A computational GRID is typically heterogeneous in the sense that it combines clus...
متن کاملAn ACO Algorithm for Scheduling Data Intensive Application with Various QOS Requirements
Grid computing is rapidly growing in the distributed heterogeneous environment for utilizing and sharing large scale resources to solve complex scientific problems. The main goal of grid computing is to aggregate the power of widely distributed resources and provide non trivial QOS services to the users. To achieve this goal, an efficient grid scheduling algorithm is required. The problem of sc...
متن کاملA Rank-Based Hybrid Algorithm for Scheduling Data- and Computation-Intensive Jobs in Grid Environments
Scheduling is one of the most important challenges in grid computing environments. Most existing scheduling algorithms in grids only focus on one type of grid jobs which can be data-intensive or computation-intensive. However, merely considering one type of jobs in scheduling does not result in proper scheduling in the viewpoint of all system, and sometimes causes wasting of resources on the ot...
متن کاملACO Based Dynamic Scheduling Algorithm for Real-Time Multiprocessor Systems
The Ant Colony Optimization (ACO) algorithms are computational models inspired by the collective foraging behavior of ants. The ACO algorithms provide inherent parallelism, which is very useful in multiprocessor environments. They provide balance between exploration and exploitation along with robustness and simplicity of individual agent. In this paper, ACO based dynamic scheduling algorithm f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Asian Journal of Scientific Research
سال: 2013
ISSN: 1992-1454
DOI: 10.3923/ajsr.2013.789.796